Reading in Colette: Domination, Resistance, Autonomy
نویسندگان
چکیده
منابع مشابه
learner autonomy in a computer-assisted project-based efl reading classroom
آموزش برمبنای ذخیره اطلاعات ، دانشجویان را به عنوان افرادی غیر متفکر وغیرقابل کنترل می پندارد . در همین راستا ، خواندن در سیستم آموزشی برمبنای ذخیره اطلاعات ، مهارتی پنداشته می شود که می توان آن را با یاد گرفتن انفعالی وجداگانه تعدادی از مهارتهای جزیی فراگرفت . درآن سو خواندن در سیستم آموزشی برمبنای طرح مسآله ،به عنوان رفتاری نقادانه تلقی می شود که از طریق آن می توان دنیای فرای کلمات را کشف کرد...
A Case Study of Goal-Driven Autonomy in Domination Games
In this paper we present an overview of a variety of efforts to attain good performance of Game AI for Domination games. These are a very popular kind of game sub-genre in which teams compete for control of locations. Due to the rules of the games, good performance is mostly dependant on overall strategy rather than the skill of individual team members.
متن کاملImportant Papers by Colette Rolland
1. Ben Achour C, Rolland C, Souveyet C, Maiden NAM (1999) Guiding use case authoring: results of an empirical study. In: Proceedings of the 4th IEEE international symposium on requirements engineering RE 1999, IEEE Computer Society, Washington, DC, USA, pp 36–43 2 Bubenko J, Rolland C, Loucopoulos P, DeAntonellis V (1994) Facilitating ‘fuzzy to formal’ requirements modelling. In: Proceedings of...
متن کاملExploring EFL Learners’ Autonomy in Reading Comprehension: Computer-Assisted versus Conventional Contexts
This study explored the autonomy of advanced English as a Foreign Language (EFL) learners in reading comprehension through scaffolding and jigsaw in computer-assisted and conventional contexts. After being homogenized through the reading section of DIALANG proficiency test, a total of 80 female advanced EFL learners with the age range of 21 to 45 were selected as the participants of the study. ...
متن کاملA characterization relating domination, semitotal domination and total Roman domination in trees
A total Roman dominating function on a graph $G$ is a function $f: V(G) rightarrow {0,1,2}$ such that for every vertex $vin V(G)$ with $f(v)=0$ there exists a vertex $uin V(G)$ adjacent to $v$ with $f(u)=2$, and the subgraph induced by the set ${xin V(G): f(x)geq 1}$ has no isolated vertices. The total Roman domination number of $G$, denoted $gamma_{tR}(G)$, is the minimum weight $omega(f)=sum_...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in 20th & 21st Century Literature
سال: 1996
ISSN: 2334-4415
DOI: 10.4148/2334-4415.1400